Route Specifications with a Linear Dual Graph
نویسنده
چکیده
The objective often explored in Web-based route planners is to find an optimal route in a network for a given mode of transport. Usually this involves searching for the cheapest route corresponding to some cost function. For many types of trips, not all desired route properties can be satisfied in this way. Following is a proposed solution for planning hiking trips. The method can easily be transferred to tourist guides in urban areas, for advice for taking a drive, or can be used in related contexts. It is anticipated that these applications will become increasingly relevant in our mobile leisure society. Planning a hiking route is based primarily on the intended length of the trip, and then on the decision about whether start and destination points need to coincide. As a result, planning trips represents neither a shortest path nor a travelling salesman problem. The problem with this approach lies in the fact that hikers require trip proposals that cannot necessarily be provided by a shortest path algorithm: round tours, routes including loops, or routes where a route segment which has to be passed in both directions are more consistent with route planning for hikers. A surprisingly simple solution for these requirements appears to be a linear dual graph, which applies a k shortest path algorithm to the linear dual graph. This paper outlines this approach and demonstrates that it achieves realistic and practical route planning.
منابع مشابه
Route Guidance for Satisfying Temporal Logic Specifications on Aircraft Motion
We present a new technique for aircraft route guidance subject to linear temporal logic (LTL) specifications. The proposed approach is based on workspace partitioning, and relies on the idea of so-called lifted graphs. Briefly, edges in a lifted graph are successions of adjacent edges in the topological graph associated with the workspace partition. We associate edges of the lifted graph with c...
متن کاملModeling Costs of Turns in Route Planning
Shortest path algorithms optimize the costs of a journey in a network. For route planning algorithms, networks are usually modeled as graphs. Different cost functions are used, like the length of a path, or the travel time. Costs are traditionally attached to edges in the graph. For some important route planning problems costs that are associated with pairs of edges can be identified. For examp...
متن کاملA Linear-time Algorithm for Orthogonal Watchman Route Problem with Minimum Bends
Given an orthogonal polygon P with n vertices, the goal of the watchman route problem is finding a path S of the minimum length in P such that every point of the polygon P is visible from at least one of the point of S. In the other words, in the watchman route problem we must compute a shortest watchman route inside a simple polygon of n vertices such that all the points interior to the polygo...
متن کاملA Fastest Route Planning for LBS based on Traffic Prediction
This paper proposes a new route plan on the basis of traffic prediction for finding a fastest route to a given destination in traffic network. So far, lots of traffic prediction systems were introduced to help drivers. Previous works were done mainly on providing restricted route services which depend on only cumulative traffic velocities. For this reason, we consider both real-time and cumulat...
متن کاملCollocational Processing in Two Languages: A psycholinguistic comparison of monolinguals and bilinguals
With the renewed interest in the field of second language learning for the knowledge of collocating words, research findings in favour of holistic processing of formulaic language could support the idea that these language units facilitate efficient language processing. This study investigated the difference between processing of a first language (L1) and a second language (L2) of congruent col...
متن کامل